Pairs of recursive structures

Analysis of Parallelism in Recursive Functions on Recursive Data Structures

In functional languages, iterative operations on data collections are naturally expressed using recursive functions on recursive data structures. In this paper, we present a method to extract data parallelism from recursive functions and generate data parallel programs. As the parallel model for object programs, we use polytypic parallel skeletons. This model can express data parallel operation...

Lovely Pairs and Dense Pairs of O-minimal Structures

We study the theory of Lovely pairs of þ-rank one theories, in particular O-minimal theories. We show that the class of א0-saturated dense pairs of O-minimal structures studied by van den Dries [6] agrees with the corresponding class of lovely pairs. We also prove that the theory of lovely pairs of O-minimal structures is super-rosy of rank ≤ ω.

Dataaow Analysis for Recursive Structures

Recursive Assertions for Data Structures

We present an assertion language for expressing properties of data structures. Its key features are constraints over arrays, multisets and integers which allow the specification of basic assertions, and rules, which allow the recursive specification of assertions. This language can thus be used to define assertions to an arbitrary level of expressiveness, ranging from low-level properties of me...

Automated Bounds on Recursive Structures

Tables are the basis for many dynamic programming algorithms on recursive structures such as trees and grids. These tables record the rules for combining structures. We show how such a table can be used to determine the maximum or minimum value of the associated parameter (the extremal function), and implement software that automatically determines the extremal function from the table, and outp...